Area-Universal and Constrained Rectangular Layouts
نویسندگان
چکیده
منابع مشابه
Area - Universal and Constrained Rectangular
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignm...
متن کاملOrientation-Constrained Rectangular Layouts
We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientationconstrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.
متن کاملA Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts
A rectangular layout L is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent VLSI chip layouts. More recently, they are used in graph drawing as rectangular cartograms. In these applications, an area a(r) is assigned to each rectangle r, and the act...
متن کاملGeometric abstractions for constrained optimization of layouts . ∗
We discuss implementation of algorithms for constrained optimization, based on CLOS objects representing standard mathematical abstractions like affine spaces, vectors , and linear transformations. These abstractions simplify using the optimization library in varied applications, facilitate animation, carry no significant performance penalty (compared to traditional Fortran implementations). Ou...
متن کاملOn the Area of Binary Tree Layouts
The binary tree is an important interconnection pattern for VLSI chip layouts. Suppose that the nodes are separated by at least unit distance and that a wire has unit width. The usual layout of a complete binary tree with n leaves takes chip area Ω(n log n), but it can be arranged that all the leaves are on the boundary of the chip. In contrast, the “recursive H” layout has area of order n, but...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2012
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110834032